A Delay and Loss Versatile Scheduling Discipline in ATM Switches
نویسندگان
چکیده
In this paper, we propose a versatile scheduling discipline, called Precedence with Partial Push–out (PPP), in Asynchronous Transfer Mode (ATM) switches supporting two delay and two loss priorities. By employing a threshold L, PPP provides delay guarantee by allowing a newly–arriving highdelay–priority cell to precede a maximum of L low-delay– priority cells. Through the use of another threshold R, the discipline offers loss guarantee by permitting a newly–arriving high-loss–priority cell to push out the last low–loss–priority cell located beyond the Rth location in a full queue. By setting L and R properly, PPP versatilely performs as any one of the four widely–accepted disciplines, namely the FCFS, head–of–line, push-out, or head–of–line with push–out disciplines. To determine L and R retaining demanded Quality of Services (QoSS), we provide an in-depth queueing analysis for the Cell Delay (CD) and Cell Loss Ratio (CLR) of high-delay-priority, low–loss–priority cells. We further propose a simple, algebra– based analysis for the CD and CLR for low-delay-priority, high-loss–priority cells. On the basis of these analyses, L and R can be dynamically and effectively adjusted to provide adequate delay and loss guarantees for high–priority cells while incurring only minimal performance degradation for other classes of cells. Finally, the paper presents simulation results confirming the accuracy of the analyses.
منابع مشابه
Resource Division Policies for EDF Scheduling in ATM Networks
The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the EarliestDeadline -First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a single scheduler....
متن کاملPerformance Evaluation of Resource Reservation Policies for Rate-Controlled Eealiest-Deadline-First Scheduling in ATM Networks*
The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the Rate Controlled EarliestDeadline-First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a si...
متن کاملCell Delay Variation and Burst Expansion in ATM Networks: Results from a Practical Study Using Fairisle
Current interest in cell delay variation in ATM networks arises from the need to provide guarantees on loss and delay for traac with real time constraints. This study uses the Fairisle ATM LAN to measure the CDV experienced by CBR and periodic, bursty sources when multiplexed with Bernoulli, VBR video and LAN interconnection traac, in a network of non-blocking ATM switches. We nd that higher bi...
متن کاملGeneralized Priority Queue Manager Design for ATM Switches*
Our concern is the problem of efficiently supporting multiple QOS requirements in ATM networks. A queue manager in ATM network nodes schedules cells’ transmission based on their urgencies at the decision moment, while it controls buffer access based on the cells’ loss priorities. In this paper, we propose a generalized priority queue manager (GPQM) which supports multiple QOS requirements in cl...
متن کاملStarvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998